A Macroscopic Exact Schema Theorem and aRede

نویسنده

  • Riccardo Poli
چکیده

This paper extends recent results in the GP schema theory by formulating a proper exact schema theorem for GP with one-point crossover. This gives an exact expression for the expected number of instances of a schema at the next generation in terms of macroscopic quantities. This result allows the exact formulation of the notion of eeective tness in GP introduced, in approximate form, by other researchers to describe the reasons for bloat and active-code compression.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II

This paper is the second part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover (Part I (Poli and McPhee, 2003)). Like other recent GP schema theory results, the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Car...

متن کامل

General Schema Theory for Genetic Programming with Subtree-Swapping Crossover

In this paper a new, general and exact schema theory for genetic programming is presented. The theory includes a microscopic schema theorem applicable to crossover operators which replace a subtree in one parent with a subtree from the other parent to produce the offspring. A more macroscopic schema theorem is also provided which is valid for crossover operators in which the probability of sele...

متن کامل

General Schema Theory for Genetic Programming with any Subtree-Swapping Crossover

In this paper a new general schema theory for genetic programming is presented. Like other recent GP schema theory results (Poli 2000a, Poli 2000b), the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system which makes it possible to describe programs as func...

متن کامل

Exact GP Schema Theory for Headless Chicken Crossover and Subtree Mutation

In this paper a new general GP schema theory for headless chicken crossover and subtree mutation is presented. The theory gives an exact formulation for the expected number of instances of a schema at the next generation. The theory includes four main results: microscopic schema theorems for both headless chicken crossover and subtree mutation, and two corresponding macroscopic theorems. The mi...

متن کامل

The Exact Schema Theorem

A colleague disuaded me from submitting it for publication, but it does contain useful results. It has been published on my website (formerly (There were some fractions that did not display correctly.) Except for the addition of this comment, updating my e-mail and website URL, and the reprocessing, there have been no changes since the verion of January 28, 2000. Abstract A schema is a naturall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000